package lanqiao.真题.第13届决赛JavaB组;

import java.util.*;

/**
 * @author 挚爱之夕
 * @version 1.0
 * @implSpec lanqiao.真题.第13届决赛JavaB组
 * @since 2023-06-06 21:43
 */

public class Main {
    public static void main(String[] args) {
        new Main().solve();
    }

    void solve() {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] x = new int[n];
        int[] y = new int[n];
        long[][][] dp = new long[n][n][n];
        for (int i = 0; i < n; i++) {
            x[i] = sc.nextInt();
            y[i] = sc.nextInt();
        }
        long res = 0;
        for (int k = 2; k < n - 2; k++) {
            for (int i = 0; i < n; i++) {
                for (int j = i + k; j < n; j++) {
                    for (int h = i; h <= j; h++) {
                        dp[i][j][k] = Math.max(dp[i][j][k], dp[i][h][k - 1] +
                                Math.abs(((long) (x[j] - x[i]) * (y[h] - y[i]) - (long) (y[j] - y[i]) * (x[h] - x[i]))));
                        res = Math.max(dp[i][j][k], res);
                    }
                }
            }
        }

        System.out.println(res);
        sc.close();
    }
}

